Permutation Classes of Polynomial Growth
نویسندگان
چکیده
منابع مشابه
Permutation Classes of Polynomial Growth
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterized as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue all ...
متن کاملOn Growth Rates of Closed Permutation Classes
A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where the relation ⊂ is the natural containment of permutations. Let Πn be the set of all permutations of 1, 2, . . . , n belonging to Π. We investigate the counting functions n 7→ |Πn| of closed classes. Our main result says that if |Πn| < 2n−1 for at least one n ≥ 1, then there is a unique k ≥ 1 such that Fn,k ≤ |Πn| ≤ Fn,...
متن کاملOn growth rates of hereditary permutation classes
A class of permutations is called hereditary if implies where the relation is the natural containment of permutations Let n be the set of all permutations of n belonging to We investigate the counting functions n j nj of hereditary classes Our main result says that if j nj n for at least one n then there is a unique k such that Fn k j nj Fn k n c holds for all n with a constant c Here Fn k are ...
متن کاملOn the effective and automatic enumeration of polynomial permutation classes
The “Fibonacci Dichotomy” of Kaiser and Klazar [15] was one of the first general results on the enumeration of permutation classes. It states that if there are fewer permutations of length n in a permutation class than the nth Fibonacci number, for any n, then the enumeration of the class is given by a polynomial for sufficiently large n. Since the Fibonacci Dichotomy was established for permut...
متن کاملDeflatability of permutation classes
A permutation class is said to be deflatable if its simple permutations are contained within a proper subclass. Deflatable classes are often easier to describe, analyze and enumerate than their non-deflatable counterparts. This paper presents theorems guaranteeing the non-deflatability of principal classes, constructs an infinite family of deflatable principal classes, and provides examples of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2007
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-007-0318-x